On matchings, <i>T</i> ?joins, and arc routing in road networks
نویسندگان
چکیده
منابع مشابه
Dynamic Arc-Flags in Road Networks
In this work we introduce a new data structure, named RoadSigns, which allows us to efficiently update the Arc-Flags of a graph in a dynamic scenario. Road-Signs can be used to compute Arc-Flags, can be efficiently updated and do not require large space consumption for many real-world graphs like, e.g., graphs arising from road networks. In detail, we define an algorithm to preprocess Road-Sign...
متن کاملRouting on Trees via Matchings
1 I n t r o d u c t i o n The permutation packet routing problem on a connected undirected graph is the following: We are given a graph G = iV, E) and a permutat ion ~r of the vertices of G. Every vertex v of G contains a packet destined for r (v ) . Our task is to route all packets to their destinations. During the routing, the movement of the packets follows a set of rules. These rules specif...
متن کاملRouting and Sorting Via Matchings On Graphs
The paper is divided in to two parts. In the first part we present some new results for the routing via matching model introduced by Alon et al [5]. This model can be viewed as a communication scheme on a distributed network. The nodes in the network can communicate via matchings (a step), where a node exchanges data with its partner. Formally, given a connected graph G with vertices labeled fr...
متن کاملFully Dynamic Maintenance of Arc-Flags in Road Networks
The problem of finding best routes in road networks can be solved by applying Dijkstra’s shortest paths algorithm. Unfortunately, road networks deriving from real-world applications are huge yielding unsustainable times to compute shortest paths. For this reason, great research efforts have been done to accelerate Dijkstra’s algorithm on road networks. These efforts have led to the development ...
متن کاملDetermining Arc Segment Significance in Two Idealized Road Networks
As road networks become increasingly congested, accurate information regarding their vulnerability to an amalgamation of situations becomes more vital. Understanding how accidents, routine closures (due to construction, public events, etc) and even premeditated attacks on individual arcs influence the road network may assist policy makers in decisions on network expansion or planning, helping t...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Networks
سال: 2021
ISSN: ['0028-3045', '1097-0037']
DOI: https://doi.org/10.1002/net.22033